Ambiguous propositions typed
نویسنده
چکیده
Ambiguous propositions are analyzed in a type system where disambiguation is effected during assembly (i.e. by coercion). Ambiguity is introduced through a layer of types that are underspecified relative to a pre-existing collection of dependent types, construed as unambiguous propositions. A simple system of reasoning directly with such underspecification is described, and shown to be sound and complete for the full range of disambiguations. Beyond erasing types, the system supports constraints on disambiguations, including co-variation.
منابع مشابه
Breaking down automaticity: case ambiguity and the shift to reflective approaches in clinical reasoning.
CONTEXT Two modes of case processing have been shown to underlie diagnostic judgements: analytical and non-analytical reasoning. An optimal form of clinical reasoning is suggested to combine both modes. Conditions leading doctors to shift from the usual mode of non-analytical reasoning to reflective reasoning have not been identified. This paper reports a study aimed at exploring these conditio...
متن کاملA Semantics for Propositions as Sessions
Session types provide a static guarantee that concurrent programs respect communication protocols. Recently, Caires, Pfenning, and Toninho, and Wadler, have developed a correspondence between propositions of linear logic and session typed π-calculus processes. We relate the cut-elimination semantics of this approach to an operational semantics for session-typed concurrency in a functional langu...
متن کاملRevisiting Parametricity: Inductives and Uniformity of Propositions
Reynold’s parametricity theory captures the property that parametrically polymorphic functions behave uniformly: they produce related results on related instantiations. In dependently typed programming languages, such relations and uniformity proofs can be expressed internally, and generated as a program translation. We present a new parametricity translation for a significant fragment of Coq. ...
متن کاملExtended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of “models”, yielding induction and recursion principles for abstract syntax. Zsidó [Zsi10, Chap. 6] proves an initiality result for simply–typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. ...
متن کاملA general-purpose dependently-typed assembly language
In this paper we present Singleton, a dependently typed assembly language. Based upon the calculus of inductive constructions, Singleton’s type system allows procedures abstracting over terms, types, propositions, and proof terms. Furthermore, Singleton includes generalised singleton types. In addition to the primitive singleton types of other languages, these generalised singleton types allow ...
متن کامل